A note on the stable equivalence problem

A note on equivalence in ranking investments

A note on single-linkage equivalence

We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and “ultrasimilarities”, and we discuss how it relates to the popular single-linkage clustering algorithm.

On the Equivalence Problem for

On the one hand, the inclusion problem for nonerasing and erasing pattern languages is undecidable; see JSSY95]. On the other hand, the language equivalence problem for NE-pattern languages is trivially decidable (see Ang80a]) but the question of whether the same holds for E-pattern languages is still open. It has been conjectured by Jiang et al. JSSY95] that the language equivalence problem fo...

A Note on the Equivalence and Complexity of Linear Grammars

Linear languages can be characterized by regular-like expressions (linear expressions) according to a previous work. In this paper, we consider some equivalence properties of linear expressions in order to obtain a characterization of reversal and Kolmogorov complexity of linear languages. First, we introduce the relationship between regular expressions equivalence properties and linear express...

A Note on Complementarity Problem

In this paper we prove a result of complementarity problem where compact condition is somewhat relaxed.